Perfect and nearly perfect sampling of work-conserving queues
نویسندگان
چکیده
منابع مشابه
Perfect and nearly perfect sampling of work-conserving queues
We present sampling-based methods to treat work-conserving queueing systems. A variety of models are studied. Besides the First Come First Served (FCFS) queues, many efforts are putted on the accumulating priority queue (APQ), where a customer accumulates priority linearly while waiting. APQs have Poisson arrivals, multi-class customers with corresponding service durations, and single or multip...
متن کاملPerfect Sampling of GI/GI/c Queues
We introduce the first class of perfect sampling algorithms for the steady-state distribution of multiserver queues with general interarrival time and service time distributions. Our algorithm is built on the classical dominated coupling from the past protocol. In particular, we use a coupled multi-server vacation system as the upper bound process and develop an algorithm to simulate the vacati...
متن کاملA Nearly Perfect Market?
Internet shopbots allow consumers to almost instantly compare prices and other characteristics from dozens of sellers via a single website. We estimate the magnitude of consumer search costs and benefits using data from a major shopbot for books. For the median consumer, the estimated benefit from simply scrolling down to search lower screens is $6.55. This amounts to about 60% of the observed ...
متن کاملNearly perfect fluidity
Shear viscosity is a measure of the amount of dissipation in a simple fluid. In kinetic theory shear viscosity is related to the rate of momentum transport by quasi-particles, and the uncertainty relation suggests that the ratio of shear viscosity η to entropy density s in units of h̄/kB is bounded by a constant. Here, h̄ is Planck’s constant and kB is Boltzmann’s constant. A specific bound has b...
متن کاملWork-Conserving Tandem Queues
Consider a tandem queue of two single-server stations with only one server for both stations, who may allocate a fraction α of the service capacity to station 1 and 1−α to station 2 when both are busy. A recent paper treats this model under classical Poisson, exponential assumptions. Using work conservation and FIFO, we show that on every sample path (no stochastic assumptions), the waiting tim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2015
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-015-9437-y